Drawing Graphs in the Hyperbolic Plane
نویسنده
چکیده
It is shown how one can draw graphs on surfaces of negative Euler characteristic by using hyperbolic geometry and hyperbolic circle packing representations. The same approach applies to drawings of hyperbolic tessellations.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملOn Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
An st-path in a drawing of a graph is self-approaching if during a traversal of the corresponding curve from s to any point t′ on the curve the distance to t′ is non-increasing. A path has increasing chords if it is self-approaching in both directions. A drawing is self-approaching (increasing-chord) if any pair of vertices is connected by a self-approaching (increasing-chord) path. We study se...
متن کاملVisual Displays for Browsing RDF Documents
Hyperbolic browsers are motivated by the “Circle Limit IV” woodcut of M.C. Escher. The hyperbolic tree view was introduced in graph drawing by Lamping and Rao [2] who observed that large structures could be compactly displayed by projecting a tree onto a hyperbolic plane. The effect of the projection is that components appear diminishing in size and radius exponentially the further they move fr...
متن کاملAlgorithms for Drawing Plane Graphs
Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...
متن کاملPercolation in the Hyperbolic Plane
The purpose of this paper is to study percolation in the hyperbolic plane and in transitive planar graphs that are quasi-isometric to the hyperbolic plane. There are several sources available which the reader may consult for background on percolation on Z [Gri89] and R [MR96] and for background on percolation on more general graphs [BS96], [Lyo00], [BS99]. For this reason, we will be quite brie...
متن کامل